On the Decomposition of an Element of Jacobian of a Hyperelliptic Curve

نویسنده

  • Koh-ichi Nagao
چکیده

In this manuscript, if a reduced divisor D0 of hyperelliptic curve of genus g over an extension field Fqn is written by a linear sum of ng elements of Fqn -rational points of the hyperelliptic curve whose x-coordinates are in the base field Fq, D0 is noted by a decomposed divisor and the set of such Fqn -rational points is noted by the decomposed factor of D0. We propose an algorithm which checks whether a reduced divisor is decomposed or not, and compute the decomposed factor, if it is decomposed. This algorithm needs a process for solving equations system of degree 2, (n − n)g variables, and (n − n)g equations over Fq. Further, for the cases (g, n) = (1, 3), (2, 2), and (3, 2), the concrete computations of decomposed factors are done by computer experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field

We study the solution of the discrete logarithm problem for the Jacobian of a curve of genus g defined over an extension field Fqn , by decomposed attack, considering a external elements B0 given by points of the curve whose x-coordinates are defined in Fq. In the decomposed attack, an element of the group which is written by a sum of some elements of external elements is called (potentially) d...

متن کامل

Skew-Frobenius Maps on Hyperelliptic Curves

The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k. Therefore its efficiency depends on the scalar multiplications. Among the fast scalar multiplication methods, there is a method using a Frobenius map. It uses a Jacobian defined over an extension field of the definit...

متن کامل

Decomposing Jacobians of Hyperelliptic Curves

Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...

متن کامل

Counting Points on the Jacobian Variety of a

Counting the order of the Jacobian group of a hyperelliptic curve over a nite eld is very important for constructing a hyperelliptic curve cryptosystem (HECC), but known algorithms to compute the order of a Jacobian group over a given large prime eld need very long running times. In this note, we propose a practical polynomial-time algorithm to compute the order of the Jacobian group for a hype...

متن کامل

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions

The use of elliptic and hyperelliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test whether the Jacobian – over a finite field Fq – of a hyperelliptic curve of the form Y 2 = X + aX + bX (with a, b ∈ Fq) has a large prime factor. His approach is to obtain candidates for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007